Evaluation of progressive treemaps to convey tree and node properties

نویسندگان

  • René Rosenbaum
  • Bernd Hamann
چکیده

In this paper we evaluate progressive treemaps. Progressive refinement has a long tradition in image communication, but is a relatively new approach for information presentation. Besides technical benefits it also promises to provide advantages important for the conveyance of data properties. In this first user study in this domain, we focus on the additional value of progressive refinement for traditional treemaps to convey the topology of a given hierarchical data set and properties of its nodes. To achieve this, we compare the results gained for common squarified treemap displays with and without progression for various related tasks and set-ups. The results we obtained indicate that progressive treemaps allow for a better conveyance of topological features and node properties in most set-ups. We also assessed the opinions of our study participants and found that progressive treemaps also lead to a better confidence about the given answers and provide more assistance and user friendliness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Treemaps with Bounded Aspect Ratio

Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap for T is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of T and its area is proportional to the weight of the corresponding node. An important ...

متن کامل

Large-Scale Data Visualization with Two-Variate Level-of-Detail Control

Space-filling approach, such as a series of TreeMaps algorithms, is one of the popular approaches in hierarchical data visualization. The original TreeMaps [1] represents the hierarchy as nested belt chart (so called slice-and-dice), and then it has been improved by squarifying or ordering the subregions representing the nodes of a tree. These algorithms represent quantitative properties of nod...

متن کامل

Treemaps for Search-Tree Visualization

Large Alpha-Beta search trees generated by game-playing programs are hard to represent graphically. This paper describes how treemaps can be applied to the visualization of these trees. The principle of treemaps is presented, and difficulties of its application to the particular structure of search trees are reviewed. An original “ordered squarified” layout is proposed. It has been implemented ...

متن کامل

Modifiable Treemaps Containing Variable-Shaped Units

This paper presents a novel method, for the visualization of hierarchical information such as directory structures or family trees. Our technique is based on nested Treemaps and inherits the main property of the Treemaps: space-filling display of hierarchical information. For each node, our technique allocates a bounding box according to a ratio (height/width) that can be modified by the user a...

متن کامل

Convex Treemaps with Bounded Aspect Ratio

Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap for T is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of T and the area of each region is proportional to the weight of the corresponding node...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012